Partitioning of Hypercubes by Resolution of Combinatorial Designs
نویسنده
چکیده
A method for the partitioning of multiprocessors with a static interconnection network in hypercube topology is presented. It is based on the view of a static interconnection network as a combinatorial design. Our mere interest is to show that by means of a transformation, well-established methods of combinatorial design theory can be used to manage tasks emerging from parallel processing, rather than to give a highly efficient hardware-related partitioning technique.
منابع مشابه
A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملCombinatorics of k-ary n-cubes with Applications to Partitioning
Many communication networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes, and toruses. This paper explores combinatorial properties of such graphs—in particular, the characterization of the subgraph of a given number of nodes with maximum edge count. Applications of these properties to partitioning parallel computations will also be discussed.
متن کاملخواص متریک و ترکیبیاتی مکعب‌های فیبوناتچی و لوکاس
An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...
متن کاملA Scalable Parallel Formulation of the Backpropagation Algorithm for Hypercubes and Related Architectures
In this paper, we present a new technique for mapping the backpropagation algorithm on hypercubes and related architectures. A key component of this technique is a network partitioning scheme which is called checkerboarding. Checkerboarding allows us to replace the all-to-all broadcast operation performed by the commonly used vertical network partitioning scheme, with operations that are much f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012